Direct limit analysis based topology optimization of foundations
نویسندگان
چکیده
منابع مشابه
Adaptive volume constraint algorithm for stress limit-based topology optimization
Homogenization or density-based topology optimization methods work by distributing a fixed amount of material to the most effective areas of the design domain so as to create an optimal structural configuration that meets the minimum compliance criteria. These topology optimization methods generally cannot control the maximum stress levels of the structure; therefore, the smoothened optimum str...
متن کاملDirect Limit of Krasner (m, n)-Hyperrings
The purpose of this paper is the study of direct limits in category of Krasner (m, n)-hyperrings. In this regards we introduce and study direct limit of a direct system in category (m, n)-hyperrings. Also, we consider fundamental relation , as the smallest equivalence relation on an (m, n)-hyperring R such that the quotient space is an (m, n)-ring, to introdu...
متن کاملTopology optimization of electric machines based on topological sensitivity analysis
Topological sensitivities are a very useful tool for determining optimal designs. The topological derivative of a domain-dependent functional represents the sensitivity with respect to the insertion of an infinitesimally small hole. In the gradient-based ON/OFF method, proposed by M. Ohtake, Y. Okamoto and N. Takahashi in 2005, sensitivities of the functional with respect to a local variation o...
متن کاملFoundations for Computable Topology
Foundations should be designed for the needs of mathematics and not vice versa. We propose a technique for doing this that exploits the correspondence between category theory and logic and is potentially applicable to several mathematical disciplines. This method is applied to devising a new paradigm for general topology, called Abstract Stone Duality. We express the duality between algebra and...
متن کاملFoundations of Declarative Data Analysis Using Limit Datalog Programs
Motivated by applications in declarative data analysis, we study DatalogZ—an extension of positive Datalog with arithmetic functions over integers. This language is known to be undecidable, so we propose two fragments. In limit DatalogZ predicates are axiomatised to keep minimal/maximal numeric values, allowing us to show that fact entailment is CONEXPTIME-complete in combined, and CONP-complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soils and Foundations
سال: 2019
ISSN: 0038-0806
DOI: 10.1016/j.sandf.2019.05.003